package sit.engreal.leetcode.mianshi;

/**
 * <a href="https://leetcode.cn/problems/string-rotation-lcci/">面试题 01.09. 字符串轮转</a>
 */
public class T01T09 {
    public boolean isFlipedString(String s1, String s2) {
        return s1.length() == s2.length() && (s2 + s2).contains(s1);
    }
}
